Optimal Partitioning for Spatial Data

نویسندگان

  • Hakan Ferhatosmanoglu
  • Divyakant Agrawal
  • Amr El Abbadi
چکیده

It is desirable to design partitioning techniques that minimize the I/O time incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for diierent types of queries. In particular, we show that hexagonal partitioning has optimal I/O cost for circular queries compared to all possible non-overlapping partitioning techniques that use convex regions. For rectangular queries, we show that although for the special case when queries are rectilinear, rectangular grid partitioning gives superior performance, hexagonal partitioning has overall better I/O cost for a general class of range queries. We also discuss storage and retrieval techniques for hexagonal partitioning using current techniques for rectangular grid partitioning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Partitioning for Efficient I/O in Spatial Databases

It is desirable to design partitioning techniques that minimize the I/O time incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for diierent types of queries, and develop multi-disk allocation techniques that maximize the degree of I/O parallelism obtained during the retrieval. We show that hexagonal partitioning has ...

متن کامل

Determination of Optimal Sampling Design for Spatial Data Analysis

Extended Abstract. Inferences for spatial data are affected substantially by the spatial configuration of the network of sites where measurements are taken. Consider the following standard data-model framework for spatial data. Suppose a continuous, spatially-varying quantity, Z, is to be observed at a predetermined number, n, of points ....[ To Countinue Click here]

متن کامل

Effective Spatial Data Partitioning for Scalable Query Processing

Recently, MapReduce based spatial query systems have emerged as a cost effective and scalable solution to large scale spatial data processing and analytics. MapReduce based systems achieve massive scalability by partitioning the data and running query tasks on those partitions in parallel. Therefore, effective data partitioning is critical for task parallelization, load balancing, and directly ...

متن کامل

Spatial coding-based approach for partitioning big spatial data in Hadoop

Spatial data partitioning (SDP) plays a powerful role in distributed storage and parallel computing for spatial data. However, due to skew distribution of spatial data and varying volume of spatial vector objects, it leads to a significant challenge to ensure both optimal performance of spatial operation and data balance in the cluster. To tackle this problem, we proposed a spatial coding-based...

متن کامل

Sensitivity Analysis of Spatial Sampling Designs for Optimal Prediction

In spatial statistic, the data analyzed which is correlated and this correlation is due to their locations in the studied region. Such correlation that is related to distance between observations is called spatial correlation. Usually in spatial data analysis, the prediction of the amount of uncertain quantity in arbitrary 4locations of the area is considered according to attained observations ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000